On the Orlicz Minkowski Problem for Polytopes
نویسندگان
چکیده
Quite recently, an Orlicz Minkowski problem has been posed and the existence part of this problem for even measures has been presented. In this paper, the existence part of the Orlicz Minkowski problem for polytopes is demonstrated. Furthermore, we obtain a solution of the Orlicz Minkowski problem for general (not necessarily even) measures.
منابع مشابه
The even Orlicz-Minkowski problem
The classical Minkowski problem lead to the Lp Minkowski problem and now to the Orlicz-Minkowski problem. Existence is demonstrated for the even Orlicz-Minkowski problem. A byproduct is a new approach to the solution of the classical Minkowski problem.
متن کاملOn the Orlicz-Brunn-Minkowski theory
Recently, Gardner, Hug and Weil developed an Orlicz-Brunn1 Minkowski theory. Following this, in the paper we further consider the 2 Orlicz-Brunn-Minkowski theory. The fundamental notions of mixed quer3 massintegrals, mixed p-quermassintegrals and inequalities are extended to 4 an Orlicz setting. Inequalities of Orlicz Minkowski and Brunn-Minkowski 5 type for Orlicz mixed quermassintegrals are o...
متن کاملRelative Stanley–reisner Theory and Lower Bound Theorems for Minkowski Sums
This note complements an earlier paper of the author by providing a lower bound theorem for Minkowski sums of polytopes. In [AS16], we showed an analogue of McMullen’s Upper Bound theorem for Minkowski sums of polytopes, estimating the maximal complexity of such a sum of polytopes. A common question in reaction to that research was the question for an analogue for the Barnette’s Lower Bound The...
متن کاملMinkowski Sum of Polytopes and Its Normality
In this paper, we consider the normality or the integer decomposition property (IDP, for short) for Minkowski sums of integral convex polytopes. We discuss some properties on the toric rings associated with Minkowski sums of integral convex polytopes. We also study Minkowski sums of edge polytopes and give a sufficient condition for Minkowski sums of edge polytopes to have IDP.
متن کاملComputing All Faces of the Minkowski Sum of V-Polytopes
We consider the problem of listing faces of the Minkowski sum of several V-polytopes in R. An algorithm for listing all faces of dimension up to j is presented, for any given 0 ≤ j ≤ d − 1. It runs in time polynomial in the sizes of input and output.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 48 شماره
صفحات -
تاریخ انتشار 2012